InforLorV4, Main, Exploration, bibRecord, 001714

Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D

Identifieur interne : 001714 ( Main/Exploration ); précédent : 001713; suivant : 001715

Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D

Auteurs : Nicolas Normand [France] ; Robin Strand [Suède] ; Pierre Evenou [France] ; Aurore Arlicot [France]

Source :

Computer vision and image understanding : (Print) [ 1077-3142 ] ; 2013.

RBID : Pascal:13-0182225

Descripteurs français

Pascal (Inist)
- Vision ordinateur, Traitement image, Concordance forme, Grille, Distance minimale, Géométrie discrète, Table conversion, A la volée, Retard, Métrique Minkowski, ..

English descriptors

KwdEn :
- Computer vision, Delay, Discrete geometry, Grid, Image processing, Look up table, Minimal distance, Minkowski metric, On the fly, Pattern matching.

Abstract

This paper presents a path-based distance, where local displacement costs vary both according to the displacement vector and with the travelled distance. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, chamfer distances and generalized distances based on Minkowski sums. We introduce algorithms to compute a translated version of a neighborhood sequence distance map both for periodic and aperiodic sequences and a method to derive the centered distance map. A decomposition of the grid neighbors, in ² and ³, allows to significantly decrease the number of displacement vectors needed for the distance transform. Overall, the distance transform can be computed with minimal delay, without the need to wait for the whole input image before beginning to provide the result image.

Affiliations:

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000080
to stream PascalFrancis, to step Curation: 000927
to stream PascalFrancis, to step Checkpoint: 000060
to stream Main, to step Merge: 001731
to stream Main, to step Curation: 001714

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D</title>
<author><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, Rue Christian Pauc, La Chantrerie</s1>
<s2>44306 Nantes</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Pays de la Loire</region>
<settlement type="city">Nantes</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name>
<affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Centre for Image Analysis, Uppsala University</s1>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<placeName><settlement type="city">Uppsala</settlement>
<region nuts="1">Svealand</region>
<region nuts="1">East Middle Sweden</region>
</placeName>
<orgName type="university">Université d'Uppsala</orgName>
</affiliation>
</author>
<author><name sortKey="Evenou, Pierre" sort="Evenou, Pierre" uniqKey="Evenou P" first="Pierre" last="Evenou">Pierre Evenou</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, Rue Christian Pauc, La Chantrerie</s1>
<s2>44306 Nantes</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Pays de la Loire</region>
<settlement type="city">Nantes</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Arlicot, Aurore" sort="Arlicot, Aurore" uniqKey="Arlicot A" first="Aurore" last="Arlicot">Aurore Arlicot</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, Rue Christian Pauc, La Chantrerie</s1>
<s2>44306 Nantes</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Pays de la Loire</region>
<settlement type="city">Nantes</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">13-0182225</idno>
<date when="2013">2013</date>
<idno type="stanalyst">PASCAL 13-0182225 INIST</idno>
<idno type="RBID">Pascal:13-0182225</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000080</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000927</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000060</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000060</idno>
<idno type="wicri:doubleKey">1077-3142:2013:Normand N:minimal:delay:distance</idno>
<idno type="wicri:Area/Main/Merge">001731</idno>
<idno type="wicri:Area/Main/Curation">001714</idno>
<idno type="wicri:Area/Main/Exploration">001714</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D</title>
<author><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, Rue Christian Pauc, La Chantrerie</s1>
<s2>44306 Nantes</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Pays de la Loire</region>
<settlement type="city">Nantes</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name>
<affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Centre for Image Analysis, Uppsala University</s1>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<placeName><settlement type="city">Uppsala</settlement>
<region nuts="1">Svealand</region>
<region nuts="1">East Middle Sweden</region>
</placeName>
<orgName type="university">Université d'Uppsala</orgName>
</affiliation>
</author>
<author><name sortKey="Evenou, Pierre" sort="Evenou, Pierre" uniqKey="Evenou P" first="Pierre" last="Evenou">Pierre Evenou</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, Rue Christian Pauc, La Chantrerie</s1>
<s2>44306 Nantes</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Pays de la Loire</region>
<settlement type="city">Nantes</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Arlicot, Aurore" sort="Arlicot, Aurore" uniqKey="Arlicot A" first="Aurore" last="Arlicot">Aurore Arlicot</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, Rue Christian Pauc, La Chantrerie</s1>
<s2>44306 Nantes</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Pays de la Loire</region>
<settlement type="city">Nantes</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
<imprint><date when="2013">2013</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer vision</term>
<term>Delay</term>
<term>Discrete geometry</term>
<term>Grid</term>
<term>Image processing</term>
<term>Look up table</term>
<term>Minimal distance</term>
<term>Minkowski metric</term>
<term>On the fly</term>
<term>Pattern matching</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Vision ordinateur</term>
<term>Traitement image</term>
<term>Concordance forme</term>
<term>Grille</term>
<term>Distance minimale</term>
<term>Géométrie discrète</term>
<term>Table conversion</term>
<term>A la volée</term>
<term>Retard</term>
<term>Métrique Minkowski</term>
<term>.</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper presents a path-based distance, where local displacement costs vary both according to the displacement vector and with the travelled distance. The corresponding distance transform algorithm is similar in its form to classical propagation-based algorithms, but the more variable distance increments are either stored in look-up-tables or computed on-the-fly. These distances and distance transform extend neighborhood-sequence distances, chamfer distances and generalized distances based on Minkowski sums. We introduce algorithms to compute a translated version of a neighborhood sequence distance map both for periodic and aperiodic sequences and a method to derive the centered distance map. A decomposition of the grid neighbors, in <sup>2</sup>
 and <sup>3</sup>
, allows to significantly decrease the number of displacement vectors needed for the distance transform. Overall, the distance transform can be computed with minimal delay, without the need to wait for the whole input image before beginning to provide the result image.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>Suède</li>
</country>
<region><li>East Middle Sweden</li>
<li>Pays de la Loire</li>
<li>Svealand</li>
</region>
<settlement><li>Nantes</li>
<li>Uppsala</li>
</settlement>
<orgName><li>Université d'Uppsala</li>
</orgName>
</list>
<tree><country name="France"><region name="Pays de la Loire"><name sortKey="Normand, Nicolas" sort="Normand, Nicolas" uniqKey="Normand N" first="Nicolas" last="Normand">Nicolas Normand</name>
</region>
<name sortKey="Arlicot, Aurore" sort="Arlicot, Aurore" uniqKey="Arlicot A" first="Aurore" last="Arlicot">Aurore Arlicot</name>
<name sortKey="Evenou, Pierre" sort="Evenou, Pierre" uniqKey="Evenou P" first="Pierre" last="Evenou">Pierre Evenou</name>
</country>
<country name="Suède"><region name="Svealand"><name sortKey="Strand, Robin" sort="Strand, Robin" uniqKey="Strand R" first="Robin" last="Strand">Robin Strand</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001714 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001714 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:13-0182225
   |texte=   Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D

Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri